Nonlinear Matroid Optimization and Experimental Design
نویسندگان
چکیده
منابع مشابه
Nonlinear Matroid Optimization and Experimental Design
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multi-criteria optimization. We provide a combinatorial polynomial time algorithm for arbitrary oracle-presented matroids, that makes repeated use of matroid intersection, and an algebraic algorithm for vectorial matroids. Our w...
متن کاملMatroid Optimization and Experimental Design ∗
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multicriteria optimization. We provide a combinatorial polynomial time algorithm for arbitrary oracle-presented matroids, that makes repeated use of matroid intersection and an algebraic algorithm for vectorial matroids. Our wor...
متن کاملhydrochlorothiazide detection in urine samples by hplc-dad and experimental design dispersive l-l microextraction
hydrochlorothiazide (hct) is a diuretic agent which is shown to be effective in the treatment of hypertension. literature reports have demonstrated that urinary excretion data may be used to assess the bioavailability of various formulations containing this thiazide. also hct consumption by the athletes is one of the drugs which should be regulated by world anti-doping agency (wada), because of...
BayesOpt: a Bayesian optimization library for nonlinear optimization, experimental design and bandits
BayesOpt is a library with state-of-the-art Bayesian optimization methods to solve nonlinear optimization, stochastic bandits or sequential experimental design problems. Bayesian optimization characterized for being sample efficient as it builds a posterior distribution to capture the evidence and prior knowledge of the target function. Built in standard C++, the library is extremely efficient ...
متن کاملLexicographic Matroid Optimization
We show that finding lexicographically minimal n bases in a matroid can be done in polynomial time in the oracle model. This follows from a more general result that the shifted problem over a matroid can be solved in polynomial time as well.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2008
ISSN: 0895-4801,1095-7146
DOI: 10.1137/070696465